Bass' identity and a coin arrangements lemma
نویسندگان
چکیده
There is no doubt that the Riemann zeta function is a function of great significance in number theory because of its connection to the distribution of prime numbers. The Ihara zeta function was first introduced by Ihara [5]. This zeta function is associated with a finite graph and aperiodic closed walks in it. Bass’ identity [1] shows that the Ihara zeta function is a determinant. It is shown in the book [12] that using this identity and some other ideas from linear algebra one can come up with the graph-theoretical analogue of the prime number theorem. Therefore, it seems that Bass’ identity plays an essential role in the theory of the Ihara zeta function of a finite graph. Since the original work of Bass [1], his identity has been proven several times in an inspiringway. Let usmention for instance [3] and a lecture of Xavier Viennot at the Newton Institute, Cambridge University in 2008. Independently, an evaluation of the Ihara zeta function of planar graphs and a determinantal formula for it appeared implicitly in thework of Kac,Ward, Feynman and Sherman on the 2-dimensional Ising problem [6,10]. This work is thus an important special case of Bass’ identity. This combinatorial approach to the Ising problem has been less popular among combinatorialists and physicists than the Pfaffian method (see [7] for an introduction to both the Feynman and the Pfaffian methods as well as the relation with the Ihara zeta function and Bass’ identity). Quite recently, however Feynman’s approach reappeared in studies of the criticality of the Ising problem on closed Riemann surfaces of a positive genus [8]. New studies of the Feynman method as well as comparisons with the Pfaffian method appear (see e.g. [2]).
منابع مشابه
Compsci 650 Applied Information Theory 1.1 Identifying Whether a Coin Is Biased
1.1 Identifying Whether a Coin is Biased Lemma 1 We need O( 1 2 ) coin tosses to discern a biased coin with the probability of 1 2 − for head (and obviously with the probability of 12 + for tail), from an unbiased coin. Proof Consider two hypothesises H1 and H2 where respectively denote biased and unbiased coins. In other words, we have the following hypothesises: { H1 : biased p(h) = 12 − H2 :...
متن کاملDerandomizing the Isolation Lemma and Lower Bounds for Circuit Size
The isolation lemma of Mulmuley et al [MVV87] is an important tool in the design of randomized algorithms and has played an important role in several nontrivial complexity upper bounds. On the other hand, polynomial identity testing is a well-studied algorithmic problem with efficient randomized algorithms and the problem of obtaining efficient deterministic identity tests has received a lot of...
متن کاملWald's Identity for the Fair Coin-Tossing Games and Some Applications
We provide a simple proof of Wald's second identity for a class of problems that can be formulated as a fair coin-tossing game. The identity provides a useful technique for computing the expected stopping time and allows us to explore the second-order moment of the so-called heads-minus-tails distribution. We also introduce some interesting applications related to this simple identity.
متن کاملAn Efficient Concurrent Repetition Theorem
H̊astad et al. (2008) prove, using Raz’s lemma (STOC ’95) the first efficient parallel repetition theorem for protocols with a non-constant number of rounds, for a natural generalization of public-coin protocols. They show that a parallel prover that convinces a fraction 1− γ of the embedded verifiers of a k-wise repeated m-message verifier can be turned into a prover with error probability 1 − ...
متن کاملAdvanced Topics in Machine Learning and Algorithmic Game Theory
We begin by examining balanced vs. unbalanced coins, where the coins stand for statistical assumptions. Assume we have two coins, a balanced coin r with distribution r0 = 1 2 and r1 = 1 2 , and an unbalanced coin p with distribution p1 = 1 2 + and p0 = 1 2 − . This scenario is equivalent to the inspection of a given assumption, trying to figure out whether it is random or better than random. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 33 شماره
صفحات -
تاریخ انتشار 2012